Algorithms : A Quest for Absolute Definitions ∗ Andreas Blass
نویسندگان
چکیده
What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turing thesis and contrast Church’s and Turing’s approaches, and we finish with some recent investigations.
منابع مشابه
Algorithms: A Quest for Absolute Definitions
What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turing thesis and contrast Church’s and Turing’s approaches, and we finish with some recent investigations.
متن کاملSimple Cardinal Characteristics of the Continuum
We classify many cardinal characteristics of the continuum according to the complexity, in the sense of descriptive set theory, of their definitions. The simplest characteristics (Σ 2 and, under suitable restrictions, Π 2 ) are shown to have pleasant properties, related to Baire category. We construct models of set theory where (unrestricted) Π 2 -characteristics behave quite chaotically and no...
متن کامل5 O ct 1 99 3 IS GAME SEMANTICS NECESSARY ?
We discuss the extent to which game semantics is implicit in the basic concepts of linear logic.
متن کاملWhen are two algorithms the same?
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
متن کاملOn the Divisible Parts of Quotient Groups
We study the possible cardinalities of the divisible part of G/K when the cardinality of K is known and when, for all countable subgroups C of G, the divisible part of G/C is countable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003